Prioritizing Test Suites by Finding Hamiltonian Paths: Preliminary Studies and Initial Results
نویسنده
چکیده
Introduction. This paper describes a technique for prioritizing a test suite by finding the least weight Hamiltonian path in a complete graph that represents relative testing costs. Our technique is especially useful when testing confronts constraints such as quotas in a Web service [3], memory overhead [4], or test execution time [5]. During the testing of modern mobile computing devices (e.g., handsets running Google Android), it is often challenging to properly handle memory constraints. Thus, even though we anticipate that our approach is valuable in a wide variety of limited resource environments, this paper focuses on prioritizing test suites for memory constrained execution. In summary, the important contributions of this paper include:
منابع مشابه
Shortest Component Path Generation of C2-Style Architecture Using Improved A* Algorithm
There are always more than one shortest paths between two components in software architecture, and in the application of path selection with additional constraints, several optimal or near optimal paths are desired. Traditional A algorithm has been successfully used in software testing activities such as finding the shortest path, selecting test suites and test suites prioritization. Little wor...
متن کاملSensitivity Analysis of Fiber-Reinforced Lamina Micro-Electro-Mechanical Switches with Nonlinear Vibration Using a Higher Order Hamiltonian Approach
In this paper, the nonlinear free vibration of fiber-reinforced lamina micro-switches is investigated, and a sensitivity analysis (SA) is given. The switches are modeled as solid rectangular beams consisting of an isotropic matrix with transversely and longitudinally isotropic reinforcements, incorporating a higher order Hamiltonian approach. An SA of the proposed micro-switch is presented by c...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملPrioritizing Test Cases For Regression
Test case prioritization techniques schedule test cases for execution in an order that attempts to increase their eeectiveness at meeting some performance goal. Various goals are possible; one involves rate of fault detection | a measure of how quickly faults are detected within the testing process. An improved rate of fault detection during testing can provide faster feedback on the system und...
متن کاملOasis: Concolic Execution Driven by Test Suites and Code Modifications
Testing remains an important aspect of checking software correctness. Manually constructed test suites are one option: they typically complete quickly, but they require human involvement in producing test cases, and their coverage may be limited. Recently, symbolic execution and concolic execution have been investigated as alternatives to test suites. These approaches require little manual inte...
متن کامل